Decorous Lower Bounds for Minimum Linear Arrangement

Decorous Lower Bounds for Minimum Linear Arrangement

Alberto Caprara DEIS, Università di Bologna, Viale Risorgimento 2, I-40136 Bologna, Italy, [email protected] Adam N. Letchford Department of Management Science, Lancaster University, Lancaster LA1 4YX, Great Britain, [email protected] Juan-José Salazar-González DEIOC, Universidad de La Laguna, c/ Astrof́ısico Francisco Sánchez, s/n E-38271 La Laguna, Tenerife, Spain, jjsalaza@...

The planar minimum linear arrangement problem is different from the minimum linear arrangement problem

In various research papers, such as [2], one will find the claim that the minLA is optimally solvable on outerplanar graphs, with a reference to [1]. However, the problem solved in that publication, which we refer to as the planar minLA, is different from the minLA, as we show in this article. In constrast to the minimum linear arrangement problem (minLA), the planar minimum linear arrangement ...

A New Lower Bound for the Minimum Linear Arrangement of a Graph

Minimum Linear Arrangement of Series-Parallel Graphs

We present a factor 14D approximation algorithm for the minimum linear arrangement problem on series-parallel graphs, where D is the maximum degree in the graph. Given a suitable decomposition of the graph, our algorithm runs in time O(|E|) and is very easy to implement. Its divide-andconquer approach allows for an effective parallelization. Note that a suitable decomposition can also be comput...

Some Lower Bounds for Estrada Index